YES 0.515 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:



HASKELL
  ↳ BR

mainModule Main
  ((pred :: Ordering  ->  Ordering) :: Ordering  ->  Ordering)

module Main where
  import qualified Prelude



Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL
  ↳ BR
HASKELL
      ↳ COR

mainModule Main
  ((pred :: Ordering  ->  Ordering) :: Ordering  ->  Ordering)

module Main where
  import qualified Prelude



Cond Reductions:
The following Function with conditions
undefined 
 | False
 = undefined

is transformed to
undefined  = undefined1

undefined0 True = undefined

undefined1  = undefined0 False

The following Function with conditions
toEnum 0 = LT
toEnum 1 = EQ
toEnum 2 = GT

is transformed to
toEnum wy = toEnum5 wy
toEnum wu = toEnum3 wu
toEnum vz = toEnum1 vz

toEnum0 True vz = GT

toEnum1 vz = toEnum0 (vz == 2) vz

toEnum2 True wu = EQ
toEnum2 wv ww = toEnum1 ww

toEnum3 wu = toEnum2 (wu == 1) wu
toEnum3 wx = toEnum1 wx

toEnum4 True wy = LT
toEnum4 wz xu = toEnum3 xu

toEnum5 wy = toEnum4 (wy == 0) wy
toEnum5 xv = toEnum3 xv



↳ HASKELL
  ↳ BR
    ↳ HASKELL
      ↳ COR
HASKELL
          ↳ NumRed

mainModule Main
  ((pred :: Ordering  ->  Ordering) :: Ordering  ->  Ordering)

module Main where
  import qualified Prelude



Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.

↳ HASKELL
  ↳ BR
    ↳ HASKELL
      ↳ COR
        ↳ HASKELL
          ↳ NumRed
HASKELL
              ↳ Narrow

mainModule Main
  (pred :: Ordering  ->  Ordering)

module Main where
  import qualified Prelude



Haskell To QDPs